union-intersection principle
- union-intersection principle
French\ \ principe d'union-intersection
German\ \ Vereinigung-Schnitt-Prinzip
Dutch\ \ vereniging-doorsnede beginsel; vereniging-doorsnede beginsel van Roy
Italian\ \ principo di unione fra intersezioni
Spanish\ \ principio de unión-intersección
Catalan\ \ -
Portuguese\ \ princípio de união-intersecção
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ union-snitt-principen
Greek\ \ ένωση-τομή αρχή
Finnish\ \ yhdiste-leikkaus-periaate
Hungarian\ \ uniómetszet-elv
Turkish\ \ birleşim-kesişim ilkesi
Estonian\ \ ühendi-ühisosa printsiip
Lithuanian\ \ jungimo sankirtos principas
Slovenian\ \ -
Polish\ \ zasada zbioru przecięć
Russian\ \ совместный принцип перекрещивания
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ -
Euskara\ \ -
Farsi\ \ -
Persian-Farsi\ \ اصل اجتماع-اشتراک
Arabic\ \ مبدأ الاتحاد - والتقاطع
Afrikaans\ \ verenigingsnydingsbeginsel
Chinese\ \ 交 并 原 理
Korean\ \ 합교원리
Statistical terms.
2014.
Look at other dictionaries:
Union Monument, Iaşi — Iaşi Union Monument Union Monument (Romanian: Monumentul Unirii), a monument of white marble in the Romanian city of Iaşi, was designed by Princess Olga Sturdza and unveiled in 1927 at the base of Carol Boulevard. It consists of a central piece… … Wikipedia
Inclusion-exclusion principle — In combinatorial mathematics, the inclusion exclusion principle (also known as the sieve principle) states that if A 1, ..., A n are finite sets, then:egin{align}iggl|igcup {i=1}^n A iiggr| {} =sum {i=1}^nleft|A i ight sum {i,j,:,1 le i < j… … Wikipedia
set theory — the branch of mathematics that deals with relations between sets. [1940 45] * * * Branch of mathematics that deals with the properties of sets. It is most valuable as applied to other areas of mathematics, which borrow from and adapt its… … Universalium
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Algebra of sets — The algebra of sets develops and describes the basic properties and laws of sets, the set theoretic operations of union, intersection, and complementation and the relations of set equality and set inclusion. It also provides systematic procedures … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Standard Boolean model — The Boolean model of information retrieval (BIR) is a classical information retrieval (IR) model and, at the same time, the first and most adopted one. It is used by virtually all commercial IR systems today. The BIR is based on Boolean Logic and … Wikipedia
fuzzy logic — ☆ fuzzy logic n. 〚< fuzzy (set), coined (1965) by L. A. Zadeh, U.S. computer scientist〛 a type of logic used in computers and other electronic devices for processing imprecise or variable data: in place of the traditional binary values, fuzzy… … Universalium
List of basic discrete mathematics topics — Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally , in the sense of not supporting or requiring the notion of continuity. Most, if not all, of the objects studied in finite… … Wikipedia
Outline of discrete mathematics — The following outline is presented as an overview of and topical guide to discrete mathematics: Discrete mathematics – study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have… … Wikipedia
